Topological complexity of real Grassmannians
نویسندگان
چکیده
We use some detailed knowledge of the cohomology ring real Grassmann manifolds G k (ℝ n ) to compute zero-divisor cup-length and estimate topological complexity motion planning for -linear subspaces in ℝ . In addition, we obtain results about monotonicity Lusternik–Schnirelmann category as a function
منابع مشابه
Real Rational Curves in Grassmannians
Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of plane conics tangent to five general conics, the (surprising) answer is that all 3264 may be real. Similarly, given any problem of enumerating p-planes incide...
متن کاملOn Infinite Real Trace Rational Languages of Maximum Topological Complexity
We consider the set Rω(Γ, D) of infinite real traces, over a dependence alphabet (Γ, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets. We reprove also that there exist some rational languages of infinite real traces which are analytic but non Borel sets, and even Σ11-complete,...
متن کاملTopological Complexity and Schwarz Genus of General Real Polynomial Equation
We prove that the minimal number of branchings of arithmetic algorithms of approximate solution of the general real polynomial equation xd + a1xd−1 + · · · + ad−1x + ad = 0 of odd degree d grows to infinity at least as log2 d. The same estimate is true for the ε-genus of the real algebraic function associated with this equation, i.e. for the minimal number of open sets covering the space Rd of ...
متن کاملPerverse Sheaves on Real Loop Grassmannians
The aim of this paper is to identify a certain tensor category of perverse sheaves on the real loop Grassmannian GrR of a real form GR of a connected reductive complex algebraic group G with the category of finite-dimensional representations of a reductive complex algebraic subgroup H of the dual group Ǧ. The root system of H is closely related to the restricted root system of GR. The fact that...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings
سال: 2021
ISSN: ['0890-1740']
DOI: https://doi.org/10.1017/prm.2020.92